Differentiation matrices for univariate polynomials
نویسندگان
چکیده
منابع مشابه
Cayley-Dixon Resultant Matrices of Multi-univariate Composed Polynomials
The behavior of the Cayley-Dixon resultant construction and the structure of Dixon matrices are analyzed for composed polynomial systems constructed from a multivariate system in which each variable is substituted by a univariate polynomial in a distinct variable. It is shown that a Dixon projection operator (a multiple of the resultant) of the composed system can be expressed as a power of the...
متن کاملOn the S-Lemma for Univariate Polynomials
The so-called S-lemma has played an important role in optimization, both in theory and in applications. The significance of S-lemma is especially pronounced in control theory, robust optimization, and non-convex quadratic optimization. Hitherto, S-lemma is however established only in the domain of quadratic functions. In this paper we shall extend the notion of S-lemma to the class of univariat...
متن کاملImproved Techniques for Factoring Univariate Polynomials
The paper describes improved techniques for factoring univariate polynomials over the integers. The authors modify the usual linear method for lifting modular polynomial factorizations so that efficient early factor detection can be performed. The new lifting method is universally faster than the classical quadratic method, and is faster than a linear method due to Wang, provided we lift suffic...
متن کاملZero sets of univariate polynomials
Let L be the zero set of a nonconstant monic polynomial with complex coe¢ cients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion of distance from a point to a subset, more general than the usual one, that allows us to measure distances to subsets like L. To verify the correctness of th...
متن کاملZeros of univariate interval polynomials
Polynomials with perturbed coefficients, which can be regarded as interval polynomials, are very common in the area of scientific computing due to floating point operations in a computer environment. In this paper, the zeros of interval polynomials are investigated. We show that, for a degree n interval polynomial, the number of interval zeros is at most n and the number of complex block zeros ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2019
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-019-00668-z